Bi-Classical Connexive Logic and its Modal Extension: Cut-elimination, completeness and duality
نویسندگان
چکیده
منابع مشابه
Connexive Modal Logic
Connexive logic is a neglected direction in non-classical logic. In the present paper, first an axiomatic system of connexive propositional logic is presented. This logic, C, is shown to be sound and complete with respect to a class of relational models. It seems that this semantics is, in fact, the first known intuitively plausible interpretation of a system of connexive logic. The presentatio...
متن کاملAtomic Cut Elimination for classical Logic
System SKS is a set of rules for classical propositional logic presented in the calculus of structures. Like sequent systems and unlike natural deduction systems, it has an explicit cut rule, which is admissible. In contrast to sequent systems, the cut rule can easily be restricted to atoms. This allows for a very simple cut elimination procedure based on plugging in parts of a proof, like norm...
متن کاملCut-elimination and Proof Search for Bi-Intuitionistic Tense Logic
We consider an extension of bi-intuitionistic logic with the traditional modalities ♦, , and from tense logic Kt. Proof theoretically, this extension is obtained simply by extending an existing sequent calculus for bi-intuitionistic logic with typical inference rules for the modalities used in display logics. As it turns out, the resulting calculus, LBiKt, seems to be more basic than most intui...
متن کاملCall-by-name reduction and cut-elimination in classical logic
We present a version of Herbelin’s λμ-calculus in the call-byname setting to study the precise correspondence between normalization and cut-elimination in classical logic. Our translation of λμ-terms into a set of terms in the calculus does not involve any administrative redexes, in particular η-expansion on μ-abstraction. The isomorphism preserves β, μ-reduction, which is simulated by a local-...
متن کاملStructural Cut Elimination: I. Intuitionistic and Classical Logic
We present new variants of known proofs of cut elimination for intui-tionistic and classical sequent calculi. In both cases the proofs proceed by three nested structural inductions, avoiding the explicit use of multi-sets and termination measures on sequent derivations. This makes them amenable to elegant and concise representations in LF, which are given in full detail.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logic and Logical Philosophy
سال: 2019
ISSN: 2300-9802,1425-3305
DOI: 10.12775/llp.2019.002